Drawing Planar Graphs with Large Vertices and Thick Edges

We consider the problem of representing size information in the edges and vertices of a planar graph. Such information can be used, for example, to depict a network of computers and information traveling through the network. We present an efficient linear-time algorithm which draws edges and vertices of varying 2-dimensional areas to represent the amount of information flowing through them. The algorithm avoids all occlusions of nodes and edges, while still drawing the graph on a compact integer grid. Article Type Communicated by Submitted Revised regular paper J. Mitchell September 2003 March 2004 Work by the first author supported in part by an Abraham and Jennie Fialkow Academic Lectureship and by ARO MURI Grant DAAH04-96-1-0013. Work by the second and third authors supported in part by the NSF under Grants CCR-9732300 and PHY9980044, and by ARO MURI Grant DAAH04-96-1-0013. A preliminary version of this paper appeared in [1] G. Barequet et al., Graphs with Thick Edges, JGAA, 8(1) 3–20 (2004) 4